Heuristic Approach for N-job, 3-machine Flow Shop Scheduling Problem Involving Transportation Time, Break down Time and Weights of Jobs
نویسنده
چکیده
This paper provides a new simple heuristic algorithm for a ‘3-Machine, njob’ flow-shop scheduling problem in which jobs are attached with weights to indicate their relative importance and the transportation time and break down intervals of machine are given. A heuristic approach method to find optimal or near optimal sequence minimizing the total weighted mean production flow time for the problem has been discussed.
منابع مشابه
Heuristic Approach Forn-jobs, 3 Machines Flow Shop Scheduling Problem Involving Transportation Time, Equivalent Job-block, Weights of Jobs and Break down Time Interval
In 1980 Miyazaki considered the weight of a job in which weight shows the relative priority over some other job in a sequencing of different jobs. After that some researchers such as Ghanshiam Das, Singh and Singhal [1981], Panwalker [1991] Sotskov, Allahverdi and Lai [2000], Chandramouli (2005) and Belwal, Mittal (2008) had considered the idea of N-job 2 machine flow shop scheduling problem wi...
متن کاملHeuristic Approach for Specially Structured Two Stage Flow Shop Scheduling to Minimize the Rental Cost, Processing Time, Set Up Time Are Associated with Their Probabilities Including Transportation Time and Job Weightage
The present paper is an attempt to develop a new heuristic algorithm, find the optimal sequence to minimize the utilization time of the machines and hence their rental cost for two stage specially structured flow shop scheduling under specified rental policy in which processing times and set up time are associated with their respective probabilities including transportation time. Further jo...
متن کاملNew Heuristic Algorithm for Flow Shop Scheduling with 3 Machines and 2 Robots Considering the Breakdown Interval of Machines and Robots Simultaneously
Scheduling is an important subject of production and operations management area. In flow-shop scheduling, the objective is to obtain a sequence of jobs which when processed in a fixed order of machines, will optimize some well defined criteria. The concept of transportation time is very important in scheduling. Transportation can be done by robots. In situations that robots are used to transpor...
متن کاملA Hybrid Approach for Fuzzy Just-In-Time Flow Shop Scheduling with Limited Buffers and Deteriorating Jobs
This paper investigates the problem of just-in-time permutation flow shop scheduling with limited buffers and linear job deterioration in an uncertain environment. The fuzzy set theory is applied to describe this situation. A novel mixed-integer nonlinear program is presented to minimize the weighted sum of fuzzy earliness and tardiness penalties. Due to the computational complexities, the prop...
متن کاملMinimizing Makespan with Start Time Dependent Jobs in a Two Machine Flow Shop
[if gte mso 9]> The purpose of this paper is to consider the problem of scheduling a set of start time-dependent jobs in a two-machine flow shop, in which the actual processing times of jobs increase linearly according to their starting time. The objective of this problem is to minimize the makespan. The problem is known to be NP-hardness[ah1] ; therefore, there is no polynomial-time algorithm...
متن کامل